Review of classical and heuristic-based navigation and path planning approaches

نویسنده

  • Adham Atyabi
چکیده

Navigation consisting of two essential components known as localization and planning is the art of steering a course through a medium. Localization matches an actual position in the real-world to a location inside a map; in other words, each location in the map refers to an actual position in the environment. Planning is finding a short, collision-free path from the starting position towards the predefined ending location. This study is a survey which focuses on introducing classic and heuristicbased path planning approaches and investigates their achievements in search optimization problems. The methods are categorized, their strengths and drawbacks are discussed, and the applications in which they have been utilized are explained.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Method for Path Planning of Mobile Robots via Fuzzy Logic and ant Colony Algorithem in Complex Daynamic Environments

Researches on mobile robot path planning with meta-heuristic methods to improve classical approaches have grown dramatically in the recent 35 years. Because routing is one of the NP-hard problems, an ant colony algorithm that is a metaheuristic method has had no table success in this area. In this paper, a new approach for solving mobile robot navigation in dynamic environments, based on the he...

متن کامل

An Integrated Experience-Based Approach to Navigational Path Planning for Autonomous Mobile Robots

Navigational path planning is a classical problem in autonomous mobile robotics. Most AI approaches to path planning use goal-directed heuristic search of problem spaces defined by spatial models of the navigation space. This paper explores an alternative approach that integrates a new case-based method with the traditional model-based method. Core issues in using case-based methods include the...

متن کامل

Safe Navigation of Mobile Robot Using A* Algorithm

Path planning contributes a very significant role in navigation of a mobile robot. The accuracy of path depends on mapping and localization of an indoor environment. A number of path planning approach are already in applications like A* Algorithms, D* Algorithm (Heuristic Approach), Dijkstra’s Algorithm (Deterministic approach), Cell Decomposition Technique etc. The conventional A* algorithm me...

متن کامل

Path planning for autonomous mobile robot navigation with ant colony optimization and fuzzy cost function evaluation

In the Motion Planning research field, heuristic methods have demonstrated to outperform classical approaches gaining popularity in the last 35 years. Several ideas have been proposed to overcome the complex nature of this NP-Complete problem. Ant Colony Optimization algorithms are heuristic methods that have been successfully used to deal with this kind of problems. This paper presents a novel...

متن کامل

Probabilistic Integrated Planning of Primary and Secondary Distribution Networks based on a Hybrid Heuristic and GA Approach

The integrated planning of distribution system reveals a complex and non-linear problem being integrated with integer and discontinues variables. Due to these technical and modeling complexities, many researchers tend to optimize the primary and secondary distribution networks individually which depreciates the accuracy of the results. Accordingly, the integrated planning of these networks is p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2013